A Preprocessing Technique for Fast Convex Hull Computation

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

GPU accelerated convex hull computation

We present a hybrid algorithm to compute the convex hull of points in three or higher dimensional spaces. Our formulation uses a GPU-based interior point filter to cull away many of the points that do not lie on the boundary. The convex hull of remaining points is computed on a CPU. The GPU-based filter proceeds in an incremental manner and computes a pseudo-hull that is contained inside the co...

متن کامل

Fast approximation of convex hull

The construction of a planar convex hull is an essential operation in computational geometry. It has been proven that the time complexity of an exact solution is Ω(NlogN). In this paper, we describe an algorithm with time complexity O(N + k), where k is parameter controlling the approximation quality. This is beneficial for applications processing a large number of points without necessity of a...

متن کامل

A Fast Convex Hull Algorithm for Binary Image

Convex hull is widely used in computer graphic, image processing, CAD/CAM and pattern recognition. In this work, we derive some new convex hull properties and then propose a fast algorithm based on these new properties to extract convex hull of the object in binary image. It is achieved by computing the extreme points, dividing the binary image into several regions, scanning the regions existin...

متن کامل

Sweep Line Algorithm for Convex Hull Revisited

Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...

متن کامل

Improvement of a Secure Convex Hull Two-Party Computation Protocol

In 2008, Wang et. al. first investigate a sort of specific secure multi-party computation--secure convex hull two-party computation, and construct two protocols based on Gift wrapping method and Quick method separately. However, there are some errors in his protocol based on Quick method. This paper proposes two effective improved protocols. In addition, we analyze and compare security, computa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Procedia Computer Science

سال: 2020

ISSN: 1877-0509

DOI: 10.1016/j.procs.2020.03.046